Compact Floor-Planning via Orderly Spanning Trees

نویسندگان

Chien-Chih Liao

Hsueh-I Lu

Hsu-Chun Yen

چکیده

Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floorplan for any n-node plane triangulation. In comparison with previous floor-planning algorithms in the literature, our solution is not only simpler in the algorithm itself, but also produces floor-plans which require fewer module types. An equally important aspect of our new algorithm lies in its ability to fit the floor-plan area in a rectangle of size (n − 1) × ⌊ 2n+1 3 ⌋ . Lower bounds on the worst-case area for floor-planning any plane triangulation are also provided in the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Floor-Planning via Orderly Spanning Trees

متن کامل

Orderly Spanning Trees with Applications

We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...

متن کامل

2 J ul 2 00 1 Orderly Spanning Trees with Applications ∗ Hsueh -

We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of a plane graph H of G, and an orderly spanning tree of H. We also...

متن کامل

Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees

We address the problem of designing compact routing tables for an unlabeled connected n-node planar network G. For each node r of G, the designer is given a routing spanning tree Tr of G rooted at r, which specifies the routes for sending packets from r to the rest of G. Each node r of G is equipped with ports 1, 2, . . . , degr, where degr is the degree of r in Tr . Each port of r is supposed ...

متن کامل